A methodology for determining an effective subset of heuristics in selection hyper-heuristics

We address the important step of determining an effective subset of heuristics in selection hyper-heuristics. Little attention has been devoted to this in the literature, and the decision is left at the discretion of the investigator. The performance of a hyper-heuristic depends on the quality and size of the heuristic pool. Using more than one heuristic is generally advantageous, however, an unnecessary large pool can decrease the performance of adaptive approaches. Our goal is to bring methodological rigour to this step. The proposed methodology uses non-parametric statistics and fitness landscape measurements from an available set of heuristics and benchmark instances, in order to produce a compact subset of effective heuristics for the underlying problem. We also propose a new iterated local search hyper-heuristic usingmulti-armed banditscoupled with a change detection mechanism. The methodology is tested on two real-world optimisation problems: course timetabling and vehicle routing. The proposed hyper-heuristic with a compact heuristic pool, outperforms state-of-the-art hyper-heuristics and competes with problem-specific methods in course timetabling, even producing new best-known solutions in 5 out of the 24 studied instances

Effective learning hyper-heuristics for the course timetabling problem

Course timetabling is an important and recurring administrative activity in most educational institutions. This article combines a general modeling methodology with effective learning hyper-heuristics to solve this problem. The proposed hyper-heuristics are based on an iterated local search procedure that autonomously combines a set of move operators. Two types of learning for operator selection are contrasted: a static (offline) approach, with a clear distinction between training and execution phases; and a dynamic approach that learns on the fly. The resulting algorithms are tested over the set of real-world instances collected by the first and second International Timetabling competitions. The dynamic scheme statistically outperforms the static counterpart, and produces competitive results when compared to the state-of-the-art, even producing a new best-known solution. Importantly, our study illustrates that algorithms with increased autonomy and generality can outperform human designed problem-specific algorithms

A Methodology for Classifying Search Operators as Intensification or Diversification Heuristics

Selection hyper-heuristics are generic search tools that dynamically choose, from a given pool, the most promising operator (low-level heuristic) to apply at each iteration of the search process. The performance of these methods depends on the quality of the heuristic pool. Two types of heuristics can be part of the pool: diversification heuristics, which help to escape from local optima, and intensification heuristics, which effectively exploit promising regions in the vicinity of good solutions. An effective search strategy needs a balance between these two strategies. However, it is not straightforward to categorize an operator as intensification or diversification heuristic on complex domains. Therefore, we propose an automated methodology to do this classification. This brings methodological rigor to the configuration of an iterated local search hyper-heuristic featuring diversification and intensification stages. The methodology considers the empirical ranking of the heuristics based on an estimation of their capacity to either diversify or intensify the search. We incorporate the proposed approach into a state-of-the-art hyper-heuristic solving two domains: course timetabling and vehicle routing. Our results indicate improved performance, including new best-known solutions for the course timetabling problem

Iterated local search using an add and delete hyper- heuristic for university course timetabling

Hyper-heuristics are (meta-)heuristics that operate at a higher level to choose or generate a set of low-level (meta-)heuristics in an attempt of solve difficult optimization problems. Iterated local search (ILS) is a well-known approach for discrete optimization, combining perturbation and hill-climbing within an iterative framework. In this study, we introduce an ILS approach, strengthened by a hyper-heuristic which generates heuristics based on a fixed number of add and delete operations. The performance of the proposed hyper-heuristic is tested across two different problem domains using real world benchmark of course timetabling instances from the second International Timetabling Competition Tracks 2 and 3. The results show that mixing add and delete operations within an ILS framework yields an effective hyper-heuristic approach

VIII Encuentro de Docentes e Investigadores en Historia del Diseño, la Arquitectura y la Ciudad

Acta de congresoLa conmemoración de los cien años de la Reforma Universitaria de 1918 se presentó como una ocasión propicia para debatir el rol de la historia, la teoría y la crítica en la formación y en la práctica profesional de diseñadores, arquitectos y urbanistas. En ese marco el VIII Encuentro de Docentes e Investigadores en Historia del Diseño, la Arquitectura y la Ciudad constituyó un espacio de intercambio y reflexión cuya realización ha sido posible gracias a la colaboración entre Facultades de Arquitectura, Urbanismo y Diseño de la Universidad Nacional y la Facultad de Arquitectura de la Universidad Católica de Córdoba, contando además con la activa participación de mayoría de las Facultades, Centros e Institutos de Historia de la Arquitectura del país y la región. Orientado en su convocatoria tanto a docentes como a estudiantes de Arquitectura y Diseño Industrial de todos los niveles de la FAUD-UNC promovió el debate de ideas a partir de experiencias concretas en instancias tales como mesas temáticas de carácter interdisciplinario, que adoptaron la modalidad de presentación de ponencias, entre otras actividades. En el ámbito de VIII Encuentro, desarrollado en la sede Ciudad Universitaria de Córdoba, se desplegaron numerosas posiciones sobre la enseñanza, la investigación y la formación en historia, teoría y crítica del diseño, la arquitectura y la ciudad; sumándose el aporte realizado a través de sus respectivas conferencias de Ana Clarisa Agüero, Bibiana Cicutti, Fernando Aliata y Alberto Petrina. El conjunto de ponencias que se publican en este Repositorio de la UNC son el resultado de dos intensas jornadas de exposiciones, cuyos contenidos han posibilitado actualizar viejos dilemas y promover nuevos debates. El evento recibió el apoyo de las autoridades de la FAUD-UNC, en especial de la Secretaría de Investigación y de la Biblioteca de nuestra casa, como así también de la Facultad de Arquitectura de la UCC; va para todos ellos un especial agradecimiento

Multi-Objective Optimization of a Multilayer Wire-on-Tube Condenser: Case Study R134a, R600a, and R513A

This study presents the optimization of a multilayer wire-on-tube condenser exposed to forced convection, using the Optimized Multi-objective Particle Swarm Optimization (OMOPSO) algorithm. The maximization of the heat transfer and the minimization of the heat exchange area were defined as objective functions. In the optimization process, the variations of eight geometric parameters of the condenser were analyzed, and the Multi-objective Evolutionary Algorithm based on Decomposition (MOEAD), Non-dominated Sorting Genetic Algorithm-II (NSGAII), and OMOPSO algorithms were statistically explored. Furthermore, the condenser optimization analysis was extended to the use of alternative refrigerants to R134a such as R600a and R513A. Among the relevant results, it can be commented that the OMOPSO algorithm presented the best option from the statistical point of view compared to the other two algorithms. Thus, optimal designs for the wire-on-tube condenser were defined for three proposed study cases and for each refrigerant, providing an overview of compact designs. Likewise, the reduction of the condenser area was analyzed in more detail, presenting a maximum reduction of 15% for the use of R134a compared to for the current design. Finally, the crossflow condition was studied with respect to the current one, concluding in a greater heat transfer and a smaller heat exchange surface

A Methodology to Determine the Subset of Heuristics for Hyperheuristics through Metalearning for Solving Graph Coloring and Capacitated Vehicle Routing Problems

In this work, we focus on the problem of selecting low-level heuristics in a hyperheuristic approach with offline learning, for the solution of instances of different problem domains. The objective is to improve the performance of the offline hyperheuristic approach, identifying equivalence classes in a set of instances of different problems and selecting the best performing heuristics in each of them. A methodology is proposed as the first step of a set of instances of all problems, and the generic characteristics of each instance and the performance of the heuristics in each one of them are considered to define the vectors of characteristics and make a grouping of classes. Metalearning with statistical tests is used to select the heuristics for each class. Finally, we used the Naive Bayes to test the set instances with k-fold cross-validation, and we compared all results statistically with the best-known values. In this research, the methodology was tested by applying it to the problems of capacitated vehicle routing (CVRP) and graph coloring (GCP). The experimental results show that the proposed methodology can improve the performance of the offline hyperheuristic approach, correctly identifying the classes of instances and applying the appropriate heuristics in each case. This is based on the statistical comparison of the results obtained with those of the state of the art of each instance